Canonical Ramsey numbers and properly colored cycles
نویسندگان
چکیده
منابع مشابه
Canonical Ramsey numbers and properly colored cycles
We improve the previous bounds on the so-called unordered Canonical Ramsey numbers, introduced by Richer [D. Richer, Unordered canonical Ramsey numbers, Journal of Combinatorial Theory Series B 80 (2000) 172–177] as a variant of the canonical Ramsey numbers introduced by Erdős and Rado [P. Erdős, R. Rado, A combinatorial theorem, Journal of the London Mathematical Society 25 (4) (1950) 249–255]...
متن کامل3-colored Ramsey Numbers of Odd Cycles
Recently we determined the Ramsey Number r(C7, C7, C7) = 25. Let G = (V (G), E(G)) be an undirected finite graph without any loops or multiple edges, where V (G) denotes its vertex set and E(G) its edge set. In the following we will often consider the complete graph Kp on p vertices and the cycle Cp on p vertices. A k−coloring (F1, F2, . . . , Fk) of a graph G is a coloring of the edges of G wi...
متن کاملOn the multi-colored Ramsey numbers of cycles
For a graph L and an integer k ≥ 2, Rk(L) denotes the smallest integer N for which for any edge-colouring of the complete graph KN by k colours there exists a colour i for which the corresponding colour class contains L as a subgraph. Bondy and Erdős conjectured that for an odd cycle Cn on n vertices, Rk(Cn) = 2 k−1(n− 1) + 1 for n > 3. They proved the case when k = 2 and also provided an upper...
متن کاملOn Edge-Colored Graphs Covered by Properly Colored Cycles
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
متن کاملLong properly colored cycles in edge colored complete graphs
Let Kc n denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(Kc n) denote the maximum number of edges of the same color incident with a vertex of Kn. A properly colored cycle (path) in Kc n is a cycle (path) in which adjacent edges have distinct colors. B. Bollobás and P. Erdös (1976) proposed the following conjecture: If ∆mon(Kc n) < b 2 c, then Kc n con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.12.025